Multiplication algorithm - PDFSEARCH.IO - Document Search Engine

Multiplication algorithm
Results: 232

#	Item
101	research highlights doi:3 2 9 Technical Perspective A New Spin on an Old Algorithm Add to Reading List Source URL: www.stat.berkeley.edu Language: English - Date: 2014-06-25 12:21:06 Numerical linear algebra Analysis of algorithms Multiplication Binary operations Strassen algorithm Algorithm Multiplication algorithm Matrix multiplication Time complexity Mathematics Theoretical computer science Algebra
102	Fast approximation of matrix coherence and statistical leverage Petros Drineas Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NYUSA Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2012-08-14 00:18:31 Numerical linear algebra Matrix theory Matrices Computational complexity theory Singular value decomposition Orthogonal matrix Matrix multiplication Randomized algorithm Low-rank approximation Algebra Linear algebra Mathematics
103	Montgomery Multiplication Duncan A. Buell October 11, 2005 Abstract We describe Montgomery multiplication. Add to Reading List Source URL: class.ece.iastate.edu Language: English - Date: 2010-02-10 20:52:08 Number theory Computer arithmetic Multiplication Montgomery reduction Multiplicative order Multiplication algorithm Modulo operation Coprime Modulo Abstract algebra Mathematics Modular arithmetic
104	Remote Timing Attacks are Practical David Brumley Stanford University [removed] Abstract Timing attacks are usually used to attack weak computing devices such as smartcards. We show that timing Add to Reading List Source URL: users.ece.cmu.edu Language: English - Date: 2014-05-29 15:38:01 RSA Timing attack Montgomery reduction OpenSSL Cipher David Brumley Multiplication algorithm Side channel attack Cryptography Public-key cryptography Electronic commerce
105	Communication-Optimal Parallel Algorithm for Strassen’s Matrix Multiplication Grey Ballard, James Demmel, Benjamin Lipshitz and Oded Schwartz Sandia National Labs UC Berkeley Add to Reading List Source URL: www.sandia.gov Language: English - Date: 2013-10-30 14:31:58 Multiplication Matrix theory Matrix multiplication Matrix Algebra Mathematics Numerical linear algebra
106	Communication-Avoiding Algorithms and Fast Matrix Multiplication Grey Ballard based on joint work with Austin Benson, James Demmel, Benjamin Lipshitz, Oded Schwartz, and many others Add to Reading List Source URL: www.sandia.gov Language: English - Date: 2014-10-01 14:30:31 Numerical linear algebra Matrix theory Binary operations Analysis of algorithms Multiplication Algorithm Fast Fourier transform Parallel computing Matrix multiplication Mathematics Algebra Linear algebra
107	Accelerating Somewhat Homomorphic Evaluation using FPGAs ¨ urk1 , Yarkın Dor¨oz2 , Berk Sunar2 and Erkay Sava¸s3 Erdin¸c Ozt¨ 1 2 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-03-28 12:45:28 Digital signal processing Fourier analysis Polynomials Multiplication Numerical analysis Multiplication algorithm Discrete Fourier transform Fast Fourier transform Homomorphic encryption Mathematics Mathematical analysis Abstract algebra
108	A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin Add to Reading List Source URL: www.sandia.gov Language: English - Date: 2013-10-08 19:02:08 Numerical linear algebra Multiplication Binary operations Analysis of algorithms Computational complexity theory Matrix multiplication Fast Fourier transform Multiplication algorithm Algorithm Mathematics Theoretical computer science Algebra
109	Avoiding Communication in Dense Linear Algebra Grey Ballard Electrical Engineering and Computer Sciences University of California at Berkeley Add to Reading List Source URL: www.sandia.gov Language: English - Date: 2013-10-08 19:17:49 Numerical linear algebra Matrix theory Multiplication Matrices Cholesky decomposition Matrix Algorithm Multiplication algorithm Eigendecomposition of a matrix Algebra Linear algebra Mathematics
110	Homework Two, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious. Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-10-12 01:34:34 Integer factorization algorithms Euclidean algorithm Multiplication Computational complexity theory Algorithm Time complexity Multiplication algorithm Greatest common divisor Quadratic sieve Mathematics Computational number theory Theoretical computer science

UPDATE